首页> 外文OA文献 >Convergence rates of sums of α-mixing triangular arrays : with an application to non-parametric drift function estimation of continuous-time processes
【2h】

Convergence rates of sums of α-mixing triangular arrays : with an application to non-parametric drift function estimation of continuous-time processes

机译:α-混合三角形阵列之和的收敛速度:在连续时间过程的非参数漂移函数估计中的应用

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

The convergence rates of the sums of α-mixing (or strongly mixing) triangular arrays of heterogeneous random variables are derived. We pay particular attention to the case where central limit theorems may fail to hold, due to relatively strong time-series dependence and/or the non-existence of higher-order moments. Several previous studies have presented various versions of laws of large numbers for sequences/triangular arrays, but their convergence rates were not fully investigated. This study is the first to investigate the convergence rates of the sums of α-mixing triangular arrays whose mixing coefficients are permitted to decay arbitrarily slowly. We consider two kinds of asymptotic assumptions: one is that the time distance between adjacent observations is fixed for any sample size n; and the other, called the infill assumption, is that it shrinks to zero as n tends to infinity. Our convergence theorems indicate that an explicit trade-off exists between the rate of convergence and the degree of dependence. While the results under the infill assumption can be seen as a direct extension of those under the fixed-distance assumption, they are new and particularly useful for deriving sharper convergence rates of discretization biases in estimating continuous-time processes from discretely sampled observations. We also discuss some examples to which our results and techniques are useful and applicable: a moving-average process with long lasting past shocks, a continuous-time diffusion process with weak mean reversion, and a near-unit-root process.
机译:得出异质随机变量的α混合(或强混合)三角形阵列之和的收敛速度。我们特别注意由于相对较强的时间序列依赖性和/或不存在高阶矩而导致中心极限定理无法成立的情况。先前的一些研究已经提出了各种版本的序列/三角阵列的大数定律,但是它们的收敛速度尚未得到充分研究。这项研究是第一个研究混合系数允许任意缓慢衰减的α-混合三角形阵列之和的收敛速度。我们考虑两种渐近假设:一种是对于任意样本大小n,相邻观测值之间的时间距离是固定的;另一种是对于任意大小的样本n而言,其固定的时间间隔是固定的。另一种称为“填充假设”,即当n趋于无穷大时,它缩小为零。我们的收敛定理表明,收敛速度和依赖程度之间存在明显的权衡。虽然填充假设下的结果可以看作是固定距离假设下的结果的直接扩展,但它们是新的,对于从离散采样的观测值估计连续时间过程中获得离散化偏差的更快收敛速率特别有用。我们还讨论了一些示例,这些示例对我们的结果和技术有用并适用:经过长期冲击的移动平均过程,均值回归较弱的连续时间扩散过程以及接近单位根的过程。

著录项

  • 作者

    Kanaya, Shin;

  • 作者单位
  • 年度 2016
  • 总页数
  • 原文格式 PDF
  • 正文语种 en
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号